Budgeting Under-Specified Tasks for Weakly-Hard Real-Time Systems
نویسندگان
چکیده
In this paper, we present an extension of slack analysis for budgeting in the design of weaklyhard real-time systems. During design, it often happens that some parts of a task set are fully specified while other parameters, e.g. regarding recovery or monitoring tasks, will be available only much later. In such cases, slack analysis can help anticipate how these missing parameters can influence the behavior of the whole system so that a resource budget can be allocated to them. It is, however, sufficient in many application contexts to budget these tasks in order to preserve weakly-hard rather than hard guarantees. We thus present an extension of slack analysis for deriving task budgets for systems with hard and weakly-hard requirements. This work is motivated by and validated on a realistic case study inspired by industrial practice. 1998 ACM Subject Classification B.8.2 Performance Analysis and Design Aids
منابع مشابه
Guaranteed On-Line Weakly-Hard Real-Time Systems
A weakly hard real-time system is a system that can tolerate some degree of missed deadlines provided that this number is bounded and guaranteed off-line. In this paper we present an on-line scheduling framework called BiModal Scheduler (BMS) for weakly-hard real-time systems. It is characterised by two modes of operation. In normal mode tasks can be scheduled with a generic scheduler (possibly...
متن کاملWeakly Hard Real-Time Systems
ÐIn a hard real-time system, it is assumed that no deadline is missed, whereas, in a soft or firm real-time system, deadlines can be missed, although this usually happens in a nonpredictable way. However, most hard real-time systems could miss some deadlines provided that it happens in a known and predictable way. Also, adding predictability on the pattern of missed deadlines for soft and firm ...
متن کاملTowards Periodic Budgeting in Real-Time Calculus
In this report, we extend the real-time calculus model with a periodic budgeting mechanism known as deferrable service. Based on this extended model, we prove a schedulability theorem for a real-time task under a deferrable server. Using this theorem, we show by means of an example that existing schedulability analysis for real-time tasks under a deferrable server is pessimistic rather than exact.
متن کاملSurvey of Weakly-Hard Real Time Schedule Theory and Its Application
Normally, tasks are classified into real time and non real time according to temporal constraints for the processing and transmitting of these tasks, consequently the worst-case response time and average performance should be focused on them. However, in practical engineering context, partly violated temporal constraints can be tolerated if the violation meets certain distribution. Nevertheless...
متن کاملHeuristic techniques for synthesis of hard real-time DSP application specific systems
We introduce an approach for design and optimization of ASIC implementations which realize multiple computational tasks under hard real-time constraints. The approach designs a multitask ASIC by combining techniques from hard real-time scheduling and behavioral synthesis. The key component of the methodology is successive multiresolution synthesis technique. The technique starts from an incompl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017